Erratum to “On type 1 representable lattices of dimension at most 4”

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representable Idempotent Commutative Residuated Lattices

It is proved that the variety of representable idempotent commutative residuated lattices is locally finite. The n-generated subdirectly irreducible algebras in this variety are shown to have at most 3n+1 elements each. A constructive characterization of the subdirectly irreducible algebras is provided, with some applications. The main result implies that every finitely based extension of posit...

متن کامل

Minimal Varieties of Representable Commutative Residuated Lattices

We solve several open problems on the cardinality of atoms in the subvariety lattice of residuated lattices and FL-algebras [4, Problems 17–19, pp. 437]. Namely, we prove that the subvariety lattice of residuated lattices contains continuum many 4-potent commutative representable atoms. Analogous results apply also to atoms in the subvariety lattice of FLi-algebras and FLo-algebras. On the othe...

متن کامل

Directed VR-Representable Graphs have Unbounded Dimension

Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. A three-dimensional visibility representation that has been studied is one in which each vertex of the graph maps to a closed rectangle in R 3 and edges are expressed by vertical visibility between rectangles. The rectangles representing vertices are disjoin...

متن کامل

On the Homological Dimension of Lattices

Let L be a finite lattice and let L̂ = L − {0̂, 1̂}. It is shown that if the order complex ∆(L̂) satisfies H̃k−2 ( ∆(L̂) ) 6= 0 then |L| ≥ 2k. Equality |L| = 2k holds iff L is isomorphic to the Boolean lattice {0, 1}k.

متن کامل

0 On bipartite graphs of defect at most 4 Ramiro

We consider the bipartite version of the degree/diameter problem, namely, given natural numbers ∆ ≥ 2 and D ≥ 2, find the maximum number Nb(∆,D) of vertices in a bipartite graph of maximum degree ∆ and diameter D. In this context, the Moore bipartite bound Mb(∆,D) represents an upper bound for Nb(∆,D). Bipartite graphs of maximum degree ∆, diameter D and order Mb(∆,D), called Moore bipartite gr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algebra universalis

سال: 2013

ISSN: 0002-5240,1420-8911

DOI: 10.1007/s00012-013-0263-y